Categorifying the zx-calculus
نویسنده
چکیده
This paper presents a symmetric monoidal and compact closed bicategory that categorifies the zx-calculus developed by Coecke and Duncan. The 1-cells in this bicategory are certain graph morphisms that correspond to the string diagrams of the zx-calculus, while the 2-cells are rewrite rules.
منابع مشابه
The ZX Calculus is incomplete for Clifford+T quantum mechanics
The ZX calculus is a diagrammatic language for quantum mechanics and quantum information processing. We prove that the ZX-calculus is not complete for the Clifford+T quantum mechanics. The completeness for this fragment has been stated as one of the main current open problems in categorical quantum mechanics [8]. The ZX calculus was known to be incomplete for quantum mechanics [7], on the other...
متن کاملPivoting makes the ZX-calculus complete for real stabilizers
We show that pivoting property of graph states cannot be derived from the axioms of the ZX-calculus, and that pivoting does not imply local complementation of graph states. Therefore the ZX-calculus augmented with pivoting is strictly weaker than the calculus augmented with the Euler decomposition of the Hadamard gate. We derive an angle-free version of the ZX-calculus and show that it is compl...
متن کاملA Complete Axiomatisation of the ZX-Calculus for Clifford+T Quantum Mechanics
We introduce the first complete and approximatively universal diagrammatic language for quantum mechanics. We make the ZX-Calculus, a diagrammatic language introduced by Coecke and Duncan, complete for the so-called Clifford+T quantum mechanics by adding four new axioms to the language. The completeness of the ZX-Calculus for Clifford+T quantum mechanics was one of the main open questions in ca...
متن کاملSupplementarity is Necessary for Quantum Diagram Reasoning
The ZX-calculus is a powerful diagrammatic language for quantum mechanics and quantum information processing. We prove that its π4 -fragment is not complete, in other words the ZXcalculus is not complete for the so called "Clifford+T quantum mechanics". The completeness of this fragment was one of the main open problems in categorical quantum mechanics, a programme initiated by Abramsky and Coe...
متن کاملY-Calculus: A language for real Matrices derived from the ZX-Calculus
The ZX-Calculus is a powerful diagrammatic language devoted to represent complex quantum evolutions. But the advantages of quantum computing still exist when working with rebits, and evolutions with real coefficients. Some models explicitly use rebits, but the ZX-Calculus can not handle these evolutions as it is. Hence, we define an alternative language solely dealing with real matrices, with a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1704.07034 شماره
صفحات -
تاریخ انتشار 2017